Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
331	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:42 Computer science Amortized analysis Potential method Accounting method Time complexity Stack Gray code Bit array Heap Theoretical computer science Analysis of algorithms Mathematics
332	(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Fourier analysis Unitary operators Digital signal processing Computational complexity theory Analysis of algorithms Fourier transform Time complexity Computational complexity of mathematical operations Euclidean algorithm Mathematical analysis Theoretical computer science Mathematics
333	au AARHUS UNIVERSITY ANNUAL REPORT 2011 Add to Reading List Source URL: madalgo.au.dk Language: English - Date: 2014-01-20 05:49:05 Mathematics Algorithms Models of computation Mathematical logic Medical algorithm Aarhus University Time complexity Cache-oblivious algorithm Bioinformatics Applied mathematics Theoretical computer science Analysis of algorithms
334	Creative Leadership Design IV – Sense-making and Designing within Complexity Title: Creative Leadership Design IV – Sense-making and Designing within Complexity Description: The component provides the student with th Add to Reading List Source URL: www.kaospilot.dk Language: English - Date: 2015-02-17 07:35:13 Strategic management Time Business Consulting Sensemaking Foresight Scenario planning Leadership Management Anticipatory thinking Futurology
335	Electronic Notes in Theoretical Computer ScienceURL: http://www.elsevier.nl/locate/entcs/volume45.html 31 pages A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Rep Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2002-09-12 20:15:55 Complexity classes Computability theory Models of computation Probabilistic complexity theory PP IP Oracle machine NP P Theoretical computer science Computational complexity theory Applied mathematics
336	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
337	Fast Algorithms for Computing Tree LCS Shay Mozes1 Dekel Tsur2 Oren Weimann3 Michal Ziv-Ukelson2 1 Brown University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-17 10:13:00 Analysis of algorithms Time complexity Tree Spanning tree NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
338	A linear delay algorithm for building concept lattices Yang Huang National Center for Biotechnology Information, NLM, NIH Joint work with Martin Farach-Colton work done at Department of Computer Science, Rutgers Universi Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-23 13:16:32 Theoretical computer science Lattice Formal concept analysis Complete lattice Time complexity Polynomial Ideal lattice cryptography Complemented lattice Abstract algebra Lattice theory Mathematics
339	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
340	CS109A Notes for LectureRunning Time A program or algorithm has a running time ( ), where is the measure of the size of the input. ( ) is the largest amount of time the program takes on any input of size . Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:57:54 Analysis of algorithms Computational complexity theory Mathematical notation Sorting algorithms Asymptotic analysis Big O notation Time complexity Quicksort Summation Mathematics Theoretical computer science Mathematical analysis

UPDATE